0.06/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.12 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.12/0.33 % Computer : n005.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1200 0.12/0.33 % WCLimit : 120 0.12/0.33 % DateTime : Tue Jul 13 14:16:18 EDT 2021 0.12/0.33 % CPUTime : 0.12/0.33 % Number of cores: 8 0.12/0.33 % Python version: Python 3.6.8 0.12/0.33 # Version: 2.6rc1-ho 0.12/0.34 # No SInE strategy applied 0.12/0.34 # Trying AutoSched0 for 59 seconds 0.17/0.39 # AutoSched0-Mode selected heuristic G_E___208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN 0.17/0.39 # and selection function SelectComplexExceptUniqMaxHorn. 0.17/0.39 # 0.17/0.39 # Preprocessing time : 0.040 s 0.17/0.39 # Presaturation interreduction done 0.17/0.39 0.17/0.39 # Proof found! 0.17/0.39 # SZS status Theorem 0.17/0.39 # SZS output start CNFRefutation 0.17/0.39 thf(mand, axiom, (mand)=(^[X4:$i > $o, X5:$i > $o, X75:$i]:~((~(X4 @ X75)|~(X5 @ X75)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mand)). 0.17/0.39 thf(mnot, axiom, (mnot)=(^[X4:$i > $o, X3:$i]:~(X4 @ X3)), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mnot)). 0.17/0.39 thf(mor, axiom, (mor)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:(X4 @ X3|X5 @ X3)), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mor)). 0.17/0.39 thf(mimplies, axiom, (mimplies)=(^[X4:$i > $o, X5:$i > $o, X78:$i]:(~(X4 @ X78)|X5 @ X78)), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mimplies)). 0.17/0.39 thf(mequiv, axiom, (mequiv)=(^[X4:$i > $o, X5:$i > $o, X85:$i]:~((~((~(X4 @ X85)|X5 @ X85))|~((~(X5 @ X85)|X4 @ X85))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mequiv)). 0.17/0.39 thf(subset, axiom, mvalid @ (mforall_ind @ (^[X20:mu]:mforall_ind @ (^[X21:mu]:mequiv @ (subset @ X20 @ X21) @ (mforall_ind @ (^[X25:mu]:mimplies @ (member @ X25 @ X20) @ (member @ X25 @ X21)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', subset)). 0.17/0.39 thf(mforall_ind, axiom, (mforall_ind)=(^[X10:mu > $i > $o, X3:$i]:![X11:mu]:(exists_in_world @ X11 @ X3=>X10 @ X11 @ X3)), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mforall_ind)). 0.17/0.39 thf(mvalid, axiom, (mvalid)=(^[X4:$i > $o]:![X3:$i]:X4 @ X3), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mvalid)). 0.17/0.39 thf(thI15, conjecture, mvalid @ (mforall_ind @ (^[X20:mu]:subset @ empty_set @ X20)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', thI15)). 0.17/0.39 thf(empty_set, axiom, mvalid @ (mforall_ind @ (^[X24:mu]:mnot @ (member @ X24 @ empty_set))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', empty_set)). 0.17/0.39 thf(existence_of_empty_set_ax, axiom, ![X7:$i]:exists_in_world @ empty_set @ X7, file('/export/starexec/sandbox/benchmark/theBenchmark.p', existence_of_empty_set_ax)). 0.17/0.39 thf(c_0_11, axiom, (mand)=(^[X4:$i > $o, X5:$i > $o, X75:$i]:~((~(X4 @ X75)|~(X5 @ X75)))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[mand, mnot]), mor])). 0.17/0.39 thf(c_0_12, axiom, (mimplies)=(^[X4:$i > $o, X5:$i > $o, X78:$i]:(~(X4 @ X78)|X5 @ X78)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[mimplies, mnot]), mor])). 0.17/0.39 thf(c_0_13, axiom, (mequiv)=(^[X4:$i > $o, X5:$i > $o, X85:$i]:~((~((~(X4 @ X85)|X5 @ X85))|~((~(X5 @ X85)|X4 @ X85))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[mequiv, c_0_11]), c_0_12])). 0.17/0.39 thf(c_0_14, plain, ![X300:$i, X306:mu]:(exists_in_world @ X306 @ X300=>![X307:mu]:(exists_in_world @ X307 @ X300=>~((~((~subset @ X306 @ X307 @ X300|![X308:mu]:(exists_in_world @ X308 @ X300=>(~member @ X308 @ X306 @ X300|member @ X308 @ X307 @ X300))))|~((~(![X309:mu]:(exists_in_world @ X309 @ X300=>(~member @ X309 @ X306 @ X300|member @ X309 @ X307 @ X300)))|subset @ X306 @ X307 @ X300)))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[subset, c_0_12]), c_0_13]), mforall_ind]), mvalid])])). 0.17/0.39 thf(c_0_15, negated_conjecture, ~(![X160:$i, X163:mu]:(exists_in_world @ X163 @ X160=>subset @ empty_set @ X163 @ X160)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thI15]), mforall_ind]), mvalid])). 0.17/0.39 thf(c_0_16, plain, ![X985:$i, X986:mu, X987:mu, X988:mu]:((~subset @ X986 @ X987 @ X985|(~exists_in_world @ X988 @ X985|(~member @ X988 @ X986 @ X985|member @ X988 @ X987 @ X985))|~exists_in_world @ X987 @ X985|~exists_in_world @ X986 @ X985)&((exists_in_world @ (esk4_3 @ X985 @ X986 @ X987) @ X985|subset @ X986 @ X987 @ X985|~exists_in_world @ X987 @ X985|~exists_in_world @ X986 @ X985)&((member @ (esk4_3 @ X985 @ X986 @ X987) @ X986 @ X985|subset @ X986 @ X987 @ X985|~exists_in_world @ X987 @ X985|~exists_in_world @ X986 @ X985)&(~member @ (esk4_3 @ X985 @ X986 @ X987) @ X987 @ X985|subset @ X986 @ X987 @ X985|~exists_in_world @ X987 @ X985|~exists_in_world @ X986 @ X985)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])])). 0.17/0.39 thf(c_0_17, negated_conjecture, (exists_in_world @ esk3_0 @ esk2_0&~subset @ empty_set @ esk3_0 @ esk2_0), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])). 0.17/0.39 thf(c_0_18, plain, ![X249:$i, X252:mu]:(exists_in_world @ X252 @ X249=>~member @ X252 @ empty_set @ X249), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[empty_set, mnot]), mforall_ind]), mvalid])])). 0.17/0.39 thf(c_0_19, plain, ![X13:mu, X11:mu, X3:$i]:(member @ (esk4_3 @ X3 @ X11 @ X13) @ X11 @ X3|subset @ X11 @ X13 @ X3|~exists_in_world @ X13 @ X3|~exists_in_world @ X11 @ X3), inference(split_conjunct,[status(thm)],[c_0_16])). 0.17/0.39 thf(c_0_20, negated_conjecture, exists_in_world @ esk3_0 @ esk2_0, inference(split_conjunct,[status(thm)],[c_0_17])). 0.17/0.39 thf(c_0_21, plain, ![X979:$i]:exists_in_world @ empty_set @ X979, inference(variable_rename,[status(thm)],[existence_of_empty_set_ax])). 0.17/0.39 thf(c_0_22, plain, ![X13:mu, X11:mu, X3:$i]:(exists_in_world @ (esk4_3 @ X3 @ X11 @ X13) @ X3|subset @ X11 @ X13 @ X3|~exists_in_world @ X13 @ X3|~exists_in_world @ X11 @ X3), inference(split_conjunct,[status(thm)],[c_0_16])). 0.17/0.39 thf(c_0_23, plain, ![X980:$i, X981:mu]:(~exists_in_world @ X981 @ X980|~member @ X981 @ empty_set @ X980), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])). 0.17/0.39 thf(c_0_24, negated_conjecture, ![X11:mu]:(member @ (esk4_3 @ esk2_0 @ X11 @ esk3_0) @ X11 @ esk2_0|subset @ X11 @ esk3_0 @ esk2_0|~exists_in_world @ X11 @ esk2_0), inference(spm,[status(thm)],[c_0_19, c_0_20])). 0.17/0.39 thf(c_0_25, plain, ![X3:$i]:exists_in_world @ empty_set @ X3, inference(split_conjunct,[status(thm)],[c_0_21])). 0.17/0.39 thf(c_0_26, negated_conjecture, ~subset @ empty_set @ esk3_0 @ esk2_0, inference(split_conjunct,[status(thm)],[c_0_17])). 0.17/0.39 thf(c_0_27, negated_conjecture, ![X11:mu]:(exists_in_world @ (esk4_3 @ esk2_0 @ X11 @ esk3_0) @ esk2_0|subset @ X11 @ esk3_0 @ esk2_0|~exists_in_world @ X11 @ esk2_0), inference(spm,[status(thm)],[c_0_22, c_0_20])). 0.17/0.39 thf(c_0_28, plain, ![X11:mu, X3:$i]:(~exists_in_world @ X11 @ X3|~member @ X11 @ empty_set @ X3), inference(split_conjunct,[status(thm)],[c_0_23])). 0.17/0.39 thf(c_0_29, negated_conjecture, member @ (esk4_3 @ esk2_0 @ empty_set @ esk3_0) @ empty_set @ esk2_0, inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_25]), c_0_26])). 0.17/0.39 thf(c_0_30, negated_conjecture, exists_in_world @ (esk4_3 @ esk2_0 @ empty_set @ esk3_0) @ esk2_0, inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_25]), c_0_26])). 0.17/0.39 thf(c_0_31, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_30])]), ['proof']). 0.17/0.39 # SZS output end CNFRefutation 0.17/0.39 # Proof object total steps : 32 0.17/0.39 # Proof object clause steps : 11 0.17/0.39 # Proof object formula steps : 21 0.17/0.39 # Proof object conjectures : 10 0.17/0.39 # Proof object clause conjectures : 7 0.17/0.39 # Proof object formula conjectures : 3 0.17/0.39 # Proof object initial clauses used : 6 0.17/0.39 # Proof object initial formulas used : 11 0.17/0.39 # Proof object generating inferences : 5 0.17/0.39 # Proof object simplifying inferences : 4 0.17/0.39 # Training examples: 0 positive, 0 negative 0.17/0.39 # Parsed axioms : 126 0.17/0.39 # Removed by relevancy pruning/SinE : 0 0.17/0.39 # Initial clauses : 116 0.17/0.39 # Removed in clause preprocessing : 48 0.17/0.39 # Initial clauses in saturation : 68 0.17/0.39 # Processed clauses : 144 0.17/0.39 # ...of these trivial : 0 0.17/0.39 # ...subsumed : 1 0.17/0.39 # ...remaining for further processing : 143 0.17/0.39 # Other redundant clauses eliminated : 0 0.17/0.39 # Clauses deleted for lack of memory : 0 0.17/0.39 # Backward-subsumed : 3 0.17/0.39 # Backward-rewritten : 0 0.17/0.39 # Generated clauses : 271 0.17/0.39 # ...of the previous two non-trivial : 264 0.17/0.39 # Contextual simplify-reflections : 0 0.17/0.39 # Paramodulations : 271 0.17/0.39 # Factorizations : 0 0.17/0.39 # NegExts : 0 0.17/0.39 # Equation resolutions : 0 0.17/0.39 # Propositional unsat checks : 0 0.17/0.39 # Propositional check models : 0 0.17/0.39 # Propositional check unsatisfiable : 0 0.17/0.39 # Propositional clauses : 0 0.17/0.39 # Propositional clauses after purity: 0 0.17/0.39 # Propositional unsat core size : 0 0.17/0.39 # Propositional preprocessing time : 0.000 0.17/0.39 # Propositional encoding time : 0.000 0.17/0.39 # Propositional solver time : 0.000 0.17/0.39 # Success case prop preproc time : 0.000 0.17/0.39 # Success case prop encoding time : 0.000 0.17/0.39 # Success case prop solver time : 0.000 0.17/0.39 # Current number of processed clauses : 72 0.17/0.39 # Positive orientable unit clauses : 14 0.17/0.39 # Positive unorientable unit clauses: 0 0.17/0.39 # Negative unit clauses : 1 0.17/0.39 # Non-unit-clauses : 57 0.17/0.39 # Current number of unprocessed clauses: 256 0.17/0.39 # ...number of literals in the above : 938 0.17/0.39 # Current number of archived formulas : 0 0.17/0.39 # Current number of archived clauses : 71 0.17/0.39 # Clause-clause subsumption calls (NU) : 2627 0.17/0.39 # Rec. Clause-clause subsumption calls : 510 0.17/0.39 # Non-unit clause-clause subsumptions : 4 0.17/0.39 # Unit Clause-clause subsumption calls : 7 0.17/0.39 # Rewrite failures with RHS unbound : 0 0.17/0.39 # BW rewrite match attempts : 0 0.17/0.39 # BW rewrite match successes : 0 0.17/0.39 # Condensation attempts : 0 0.17/0.39 # Condensation successes : 0 0.17/0.39 # Termbank termtop insertions : 26565 0.17/0.39 0.17/0.39 # ------------------------------------------------- 0.17/0.39 # User time : 0.048 s 0.17/0.39 # System time : 0.009 s 0.17/0.39 # Total time : 0.057 s 0.17/0.39 # Maximum resident set size: 1804 pages 0.17/0.39 EOF